Polar Codes are Optimal for Lossy Source Coding
نویسندگان
چکیده
منابع مشابه
Polar codes for distributed hierarchical source coding
Hierarchical source coding, also known as successive refinement of information, was introduced by Koshelev [1,2] and Equitz and Cover [3]. This problem is concerned with the construction of a source code for a discrete memoryless source X with respect to a given distortion measure d1 that can be further refined to represent the same source within another distortion measure d2 so that both repre...
متن کاملPolar Codes for Channel and Source Coding
Polar codes, introduced recently by Arıkan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking. We discuss several techniques through which their finite-length performan...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملDistributed Lossy Source Coding Using BCH-DFT Codes
Distributed source coding, separate encoding (compression) and joint decoding of statistically dependent sources, arises in an increasing number of applications like sensor networks and multiview video coding. Many of those applications are highly interactive, requiring the development of low-delay, energy-limited communication and computing schemes. Currently, this compression is performed by ...
متن کاملLossy Joint Source-Channel Coding Using Raptor Codes
The straightforward application of Shannon’s separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2040961